Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method
نویسندگان
چکیده
منابع مشابه
Compactness and Flow Minimization Requirements in Reforestation Initiatives: An Integer Programming (IP) Formulation
Identifying optimal sites on raster maps is a complex problem when the sites are larger than the cell size. Optimal sites involves a tradeoff between the intrinsic characteristics of individual cells and the spatial configuration of the cells. Although there are a number of techniques to solve the site allocation problem, those solutions do not consider spatial interactions between the cells fo...
متن کاملMHD Nanofluid Flow Analysis in a Semi-Porous Channel by a Combined Series Solution Method
In this paper, Least Square Method (LSM) and Differential Transformation Method (DTM) are used to solve the problem of laminar nanofluid flow in a semi-porous channel in the presence of transverse magnetic field. Due to existence some shortcomings in each method, a novel and efficient method named LS-DTM is introduced which omitted those defects and has an excellent agreement with numerical sol...
متن کاملA Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling
This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A Heuristic Solution Method to a Stochastic Vehicle Routing Problem
In order to solve real-world vehicle routing problems, the standard Vehicle Routing Problem (VRP) model usually needs to be extended. Here we consider the case when customers can call in orders during the daily operations, i.e. both customer locations and demand may be unknown in advance. Our heuristic approach attempts to minimize the expected number of vehicles and their travel distance in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2011
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-011-0874-7